Viterbi-based Decoding Algorithm for DBO-CSS
نویسندگان
چکیده
منابع مشابه
Viterbi-based Decoding Algorithm for DBO-CSS
657 Abstract— Differential detection algorithm for DBO-CSS based on maximum signal energy detection (MSED) using viterbi algorithm is proposed. In order to mitigate SNR degradation caused by differential decoding, a modified viterbi algorithm with so called correlation metric (CM) in every state is proposed. It is shown that the performance gain of the proposed algorithm when compared with that...
متن کاملcient parallel algorithm for list Viterbi decoding
There is nowadays an increasing interest in list Viterbi decoding, especially for transmission of audio and video over wireless channels. List Viterbi decoding outperforms conventional Viterbi decoding at the expense of an increase in complexity. In this paper, we propose an e cient parallel list Viterbi algorithm with lower computational complexity and memory requirements. ? 2002 Elsevier Scie...
متن کاملA new transform algorithm for Viterbi decoding
AbstmctImplementation of the Viterbi decoding algorithm has attracted a great deal of interest in many applications, but the excessive hardwarehime consumptions caused by the dynamic and backtracking decoding procedures make it difficult to design efficient VLSI circuits for practical applications. A new transform algorithm for maximum likelihood decoding is derived from trellis coding and Vite...
متن کاملFPGA Implementation of Viterbi Algorithm for Decoding of Convolution Codes
Abstract: Convolutional code is a coding scheme used in communication systems including deep space communications and wireless communications. It provides an alternative approach to block codes for transmission over a noisy channel. The block codes can be applied only for the block of data. The Convolutional coding has an advantage over the block codes in that it can be applied to a continuous ...
متن کاملIterative Viterbi A* Algorithm for K-Best Sequential Decoding
Sequential modeling has been widely used in a variety of important applications including named entity recognition and shallow parsing. However, as more and more real time large-scale tagging applications arise, decoding speed has become a bottleneck for existing sequential tagging algorithms. In this paper we propose 1-best A*, 1-best iterative A*, k-best A* and k-best iterative Viterbi A* alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of information and communication convergence engineering
سال: 2011
ISSN: 2234-8255
DOI: 10.6109/ijice.2011.9.6.657